منابع مشابه
Inequalities : Theory of majorization and its applications
insisting that the equality sign holds when k = n. Here, x[X] > • • • > x[n] are the xt arranged in decreasing order and, similarly, y[X] > • • • > y[n]. If (1) is only required for the increasing (decreasing) convex functions on R then one speaks of weak sub-majorization x >, respectively). The first is equivalent to (2). Let & be an open convex subset of R...
متن کاملLatin-majorization and its linear preservers
In this paper we study the concept of Latin-majorizati-\on. Geometrically this concept is different from other kinds of majorization in some aspects. Since the set of all $x$s Latin-majorized by a fixed $y$ is not convex, but, consists of union of finitely many convex sets. Next, we hint to linear preservers of Latin-majorization on $ mathbb{R}^{n}$ and ${M_{n,m}}$.
متن کاملPointwise hereditary majorization and some applications
A pointwise version of the Howard–Bezem notion of hereditary majorization is introduced which has various advantages, and its relation to the usual notion of majorization is discussed. This pointwise majorization of primitive recursive functionals (in the sense of Gödel’s T as well as Kleene/Feferman’s P̂R) is applied to systems of intuitionistic and classical arithmetic (H and Hc) in all finite...
متن کاملMultitarget Miss Distance and Its Applications
The concept of miss distance—Euclidean, Mahalanobis, etc.—is a fundamental, far-reaching, and taken-for-granted element of the engineering theory and practice of single-sensor, single-target systems. One might expect that multisensor, multitarget information fusion theory and applications would already rest upon a similarly fundamental concept—namely, miss distance between multi-object systems ...
متن کاملSeparable Distance Transformation and its Applications
Metric based description and analysis of shapes a fundamental notion in image analysis and processing. Among classical tools, the distance transform (DT) [54, 39] of a binary image I : Zd → {0,1} consists in labeling each point of a digital object E, defined as pixels with value 1 for instance on I, with its shortest distance to the complement of E. In the literature, DT has been widely used as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2013
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-013-0697-1